computability theory
英
美
网络 可计算性理论; 可计算理论; 促使可计算理论; 递归论
双语例句
- Computability theory examines the limitations of various theoretical models of the computer, including the most powerful known model – the Turing machine.
可计算性理论探讨了计算机的各种理论模型的局限性，包括已知的最强大的模式，-图灵机。 - This includes computability theory, computational complexity theory, and information theory.
这包括可计算性理论，计算复杂性理论，信息理论。 - The following table shows some of the classes of problems that are considered in computability theory and complexity theory.
下面的表格指出了在可计算性和复杂性理论应当考虑的一些种类的问题。 - It is a formal theory of computability in the same sense as classical logic is a formal theory of truth.
它是可计算性的形式理论，正如经典逻辑是真理的形式理论。 - For curricula automata subject a more advanced graduate course, computability theory and computational complexity theory are also covered.
高级课程中还包括了可计算包括理论模型理论和计算复杂性理论。 - They will be able to use these methods in subsequent courses in the design and analysis of algorithms, computability theory, software engineering, and computer systems.
尔后课程中将可利用这些方法来设计与分析算法、可计算理论、软件工程与计算机系统。 - In one word, the task of interactive computability theory is to determine the computing capability of interactive systems and interaction mechanisms.
交互可计算性理论的问题归结为一点，就是研究交互式系统和交互机制的计算能力。 - The series papers systematically discuss the computability and the computational capacity of DNA molecular using the formal language and automata theory.
本系列文章应用形式语言及自动机理论技术，系统地探讨了DNA分子的可计算性及其计算能力。 - With the use of computability theory dividing whole_word coding into two parts: writing input coding and computational coding, an method of none keyboard mapping for spelling language is proposed.
本文依据可计算性理论，提出了拼音文字非键盘映射编码方法，将整词编码分为输写码与计算码。 - The computability theory is one of the vital and hard problems in computer scientific research nowadays.
可计算性理论是当今计算机科学中研究的热点和难点问题之一。 - Computable analysis is a branch of computability theory studying real numbers and real functions which can be computed by digital computers. Computable analysis is based on the one hand on analysis and numerical analysis and on the other hand on computability theory and computational complexity theory.
可计算分析是一门研究实数与实函数的可计算性与计算复杂性的新兴学科，属于数值计算与可计算性理论的交叉领域。 - The contribution to interactive computability theory is that the capability of sequential ⅱ-style interactive systems is totally determined, while related work mainly focuses on that of sequential ⅰ-style interactive systems. 2.
对交互可计算性理论的贡献在于：确定了顺序的Ⅱ型交互式系统的计算能力，而相关工作主要集中于顺序的Ⅰ型交互式系统的计算能力。 - From the perspective of computability theory, static analysis is a computationally undecidable problem.
从可计算性理论的角度来看，静态缺陷检测是一个不可判定问题。 - However, computability theory, a computer science& tribe a simple mathematical proof to infer the following results: can not completely solve the so-called "crash"( referring to any computer program will enter an infinite loop, or the strike and generate output) Problem.
然而，在可计算理论计算机科学的一个支派一个简单的数学证明推断出下列结果：不可能完全解决所谓当机（指任意电脑程序是否会进入无限循环、或者罢工并产生输出）问题。